Computation of Hilbert Transform via Discrete Cosine Transform
نویسندگان
چکیده
Hilbert transform (HT) is an important tool in constructing analytic signals for various purposes, such as envelope and instantaneous frequency analysis, amplitude modulation, shift invariant wavelet analysis and Hilbert-Huang decomposition. In this work we introduce a method for computation of HT based on the discrete cosine transform (DCT). We show that the Hilbert transformed signal can be obtained by replacing the cosine kernel in inverse DCT by the sine kernel. We describe a FFT-based method for the computation of HT and the analytic signal. We show the usefulness of the proposed method in mechanical vibration and ultrasonic echo and transmission measurements.
منابع مشابه
Comparison of Image Approximation Methods: Fourier Transform, Cosine Transform, Wavelets Packet and Karhunen-Loeve Transform
In this paper we compare the performance of several transform coding methods, Discrete Fourier Transform, Discrete Cosine Transform, Wavelets Packet and Karhunen-Loeve Transform, commonly used in image compression systems through experiments. These methods are compared for the effectiveness as measured by rate-distortion ratio and the complexity of computation.
متن کاملRadix-2 Algorithms for Implementation of Type-II Discrete Cosine Transform and Discrete Sine Transform
In this paper radix-2 algorithms for computation of type-II discrete cosine transform (DCT) and discrete sine transform (DST) of length N = 2 (n ≥ 2) are presented. The DCT/DST can be computed from two DCT/DST sequences, each of length N/2. The odd-indexed output components of DCT/DST can be realized using simple recursive relations. The proposed algorithms require a reduced number of arithmeti...
متن کاملA Dual Tree Complex Discrete Cosine Harmonic Wavelet Transform (ADCHWT) and Its Application to Signal/Image Denoising
A new simple and efficient dual tree analytic wavelet transform based on Discrete Cosine Harmonic Wavelet Transform DCHWT (ADCHWT) has been proposed and is applied for signal and image denoising. The analytic DCHWT has been realized by applying DCHWT to the original signal and its Hilbert transform. The shift invariance and the envelope extraction properties of the ADCHWT have been found to be ...
متن کاملA New Recursive Decomposition Algorithm for Realizing Fast IMDCT Computation
In this paper, a new decomposition algorithm for realizing fast inverse modified discrete cosine transform (IMDCT) computation is presented. The decomposition algorithm can convert a pair of long transforms into 2 pairs of short transforms with half size of the long transforms. In addition, the decomposition algorithm can be utilized recursively to attain shorter transforms and reduce computati...
متن کاملModified Discrete Cosine Transform for Encoding Residual Signals in Frequency Domain Linear Prediction
Frequency Domain Linear Prediction (FDLP) uses auto-regressive models to represent Hilbert envelopes of relatively long segments of speech/audio signals. Although the basic FDLP audio codec achieves good quality of the reconstructed signal at high bit-rates, there is a need for scaling to lower bit-rates without degrading the reconstruction quality. Here, we present a method for improving the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Signal and Information Processing
دوره 1 شماره
صفحات -
تاریخ انتشار 2010